On unimodal sequences of graphical invariants
نویسندگان
چکیده
منابع مشابه
Unimodal inversion sequences and related pattern classes
Four of these classes were separately shown previously to be enumerated by this sequence, while the five others are new. In chronological order of publication, see [1, Lemma 10] for T2, [4, Example 6.4] for T9, [9, Theorems 3.4 and 3.5] for T4, and [3, Section 3.3] for T8. The same sequence also enumerates unimodal inversion sequences [8]. An inversion sequence (subexcedant sequence, a reversal...
متن کاملAsymptotic formulas for stacks and unimodal sequences
We study enumeration functions for unimodal sequences of positive integers, where the size of a sequence is the sum of its terms. We survey known results for a number of natural variants of unimodal sequences, including Auluck’s generalized Ferrers diagrams, Wright’s stacks, and Andrews’ convex compositions. These results describe combinatorial properties, generating functions, and asymptotic f...
متن کاملDynamics of continued fractions and kneading sequences of unimodal maps
In this paper we construct a correspondence between the parameter spaces of two families of one-dimensional dynamical systems, the α-continued fraction transformations Tα and unimodal maps. This correspondence identifies bifurcation parameters in the two families, and allows one to transfer topological and metric properties from one setting to the other. As an application, we recover results ab...
متن کاملAsymptotics for the Number of Strongly Unimodal Sequences
We give an asymptotic for the number of strongly unimodal sequences of weight n, denoted u∗(n) with error of size O(n ). The result relies on an identity expressing the generating function for u∗(n) as a mixed mock modular form.
متن کاملComplexity of unimodal maps with aperiodic kneading sequences
It is well established that a formal language generated from a unimodal map is regular if and only if the map’s kneading sequence is either periodic or eventually periodic. A previously proposed conjecture said that if a language generated from a unimodal map is context-free, then it must be regular, i.e. there exists no proper context-free language which can be generated from a unimodal map. T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1981
ISSN: 0095-8956
DOI: 10.1016/0095-8956(81)90069-1